Planar linkages following a prescribed motion
نویسندگان
چکیده
منابع مشابه
Planar Linkages Following a Prescribed Motion
Designing mechanical devices, called linkages, that draw a given plane curve has been a topic that interested engineers and mathematicians for hundreds of years, and recently also computer scientists. Already in 1876, Kempe proposed a procedure for solving the problem in full generality, but his constructions tend to be extremely complicated. We provide a novel algorithm that produces much simp...
متن کاملSingular Foci of Planar Linkages
The focal points of a curve traced by a planar linkage capture essential information about the curve. Knowledge of the singular foci can be helpful in the design of path-generating linkages and is essential to the determination of path cognates. This paper shows how to determine the singular foci of planar linkages built with rotational links. The method makes use of a general formulation of th...
متن کاملPlanar Linkages and Algebraic Sets
An abstract linkage is a one dimensional simplicial complex L with a positive number `(vw) assigned to each edge vw. A planar realization of an abstract linkage (L, `) is a mapping φ from the vertices of L to C so that |φ(v) − φ(w)| = `(vw) for all edges vw. We will investigate the topology of the space of planar realizations of linkages. You may think of an abstract linkage as an ideal mechani...
متن کاملSemiconfiguration Spaces of Planar Linkages
This paper characterizes which subsets of Cn can be the set of positions of n points on a linkage in C. For example, assuming compactness they are just compact semialgebraic sets. Noncompact configuration spaces are semialgebraics sets invariant under the Euclidean group, with compact quotient.
متن کاملTight Bounds for Linkages in Planar Graphs
The Disjoint-Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1), . . . , (sk, tk), whether there is a collection of k pairwise vertex-disjoint paths linking si and ti, for i = 1, . . . , k. In their f(k) · n algorithm for this problem, Robertson and Seymour introduced the irrelevant vertex technique according to which in every instance of treewidth greater than g(k) th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2016
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3120